System and method for multi-channel frequency hopping spread spectrum communication

ABSTRACT

One embodiment of the present invention sets forth a technique for transmitting data in a frequency hopping spread spectrum (FHSS) wireless communication system. A multi-channel receiver is configured to receive data from one or more channels simultaneously. The multi-channel receiver enables efficient implementation of a transmission protocol in which multiple candidate nodes within a wireless mesh network are polled for availability to receive a packet of data. The packet of data is transmitted to one or more available nodes based on prevailing link conditions, thereby increasing the likelihood of successful delivery. Data flooding may be selectively implemented to further increase the likelihood of successful delivery.

BACKGROUND

Technical Field

Embodiments of the present invention relate generally to wirelessdigital communication systems and methods and, more specifically, to asystem and method for multi-channel frequency hopping spread spectrumcommunication.

Description of the Related Art

A conventional wireless mesh network includes a plurality of nodes, eachincorporating a digital radio transceiver. A given node may transmitpayload data to one or more other nodes via the digital radiotransceiver. The node may originate the payload data or forward thepayload data on behalf of another node. Similarly, a given node mayreceive the payload data from a different node to be processed orforwarded by the node. The wireless mesh network may include anarbitrary number of nodes and may include certain access points,configured to bridge data communications within the mesh network to arelated service system, such as a wire line or optical communicationsnetwork.

The digital radio transceiver may implement specific modulation andspectral utilization techniques to satisfy a particular set of technicalrequirements. For example, frequency hopping spread spectrum (FHSS) maybe implemented to avoid potentially excessive interference among nodesthat are attempting to transmit on a common radio frequency channel inan arbitrary window of time. FHSS involves transmitting data on oneradio frequency channel for up to a specified maximum time duration andsubsequently transmitting on a different radio frequency channel for upto another specified maximum time duration. FHSS systems typicallyfollow a specific channel hop sequence, which both the transmitter andreceiver need to follow to maintain a reliable communications channel.The transmitter reduces average radio frequency energy associated with agiven channel by hopping to a different channel after a specifiedmaximum time duration, thereby reducing a probability of interferenceamong nodes attempting to transmit on the same channel.

FHSS systems conventionally require the transmitter and receiver pair tobe synchronized, which is typically accomplished via a synchronizationprocedure conducted between the transmitter and receiver. Overheadassociated with the synchronization procedure and related transmissionlatencies can substantially reduce overall transmission efficiency andnetwork throughput.

One challenge in implementing a wireless mesh network is achievingsufficient overall throughput and latency specifications. Overallthroughput and latency are generally a function of overall utilization,link error rates, link bandwidth, and link transmission latency. Asutilization increases, channel collision probabilities increase, leadingto multiple dropped packets, which in turn result in additional overallutilization from transmission retry mechanisms. FHSS in wireless meshnetworks offers certain benefits, including regulatory compliance incertain scenarios. However, inefficiencies associated with FHSS, such astransmission latency and synchronization overhead can significantlydiminish overall network throughput and increase average linktransmission latencies. In certain wireless mesh network applications,FHSS is required by prevailing regulations and overall networkthroughput and average latencies suffer from the above describedinefficiencies.

As the foregoing illustrates, what is needed in the art is a moreefficient technique for transmission in an FHSS wireless mesh networkenvironment.

SUMMARY

One embodiment of the present invention sets forth a method forforwarding a packet of data from a source node to a destination nodewithin a wireless network via a target node, the method comprisingreceiving from the source node a poll message via a first channel withina plurality of simultaneously monitored channels that requestsavailability information for the target node, transmitting anacknowledgement message to the source node that includes theavailability information for the target node, receiving a data messagefrom the source node that includes payload data to be forwarded to anext-hop node within the wireless network, transmitting adata-acknowledge message to the source node indicating successfulreceipt of the data message, and forwarding the payload data to thenext-hop node.

Other embodiments include, without limitation, a computer-readablemedium that includes instructions that enable a processing unit toimplement one or more aspects of the disclosed methods as well as asystem configured to implement one or more aspects of the disclosedmethods.

BRIEF DESCRIPTION OF THE DRAWINGS

So that the manner in which the above recited features of the presentinvention can be understood in detail, a more particular description ofthe invention, briefly summarized above, may be had by reference toembodiments, some of which are illustrated in the appended drawings. Itis to be noted, however, that the appended drawings illustrate onlytypical embodiments of this invention and are therefore not to beconsidered limiting of its scope, for the invention may admit to otherequally effective embodiments.

FIG. 1 illustrates a general wireless mesh network, configured toimplement one or more aspects of the present invention;

FIG. 2 illustrates a radio transceiver configured to implementmulti-channel operation, according to one embodiment of the invention;

FIG. 3A illustrates a frequency hopping transmission that targets amulti-channel receiver, according to one embodiment of the presentinvention;

FIG. 3B represents energy within a group of channels for one time span,according to one embodiment of the present invention;

FIG. 3C represents energy within the group of channels for another timespan, according to one embodiment of the present invention;

FIG. 3D illustrates channel group hopping, according to one embodimentof the present invention;

FIG. 4A illustrates a four step communications protocol for transmittingpayload data to a single transmission target, according to oneembodiment of the present invention;

FIG. 4B illustrates a four step communications protocol for transmittingpayload data to multiple transmission targets, according to oneembodiment of the present invention;

FIG. 5 is a flow diagram of method steps for transmitting payload datavia the four step communications protocol, according to one embodimentof the invention;

FIG. 6 is a flow diagram of method steps for receiving payload data viathe four step communications protocol, according to one embodiment ofthe present invention; and

FIG. 7 is a flow diagram of method steps for receiving payload data viaone of a plurality of radio frequency channels, according to oneembodiment of the present invention.

DETAILED DESCRIPTION

In the following description, numerous specific details are set forth toprovide a more thorough understanding of the present invention. However,it will be apparent to one of skill in the art that the presentinvention may be practiced without one or more of these specificdetails. In other instances, well-known features have not been describedin order to avoid obscuring the present invention.

FIG. 1 illustrates a network system 100, configured to implement one ormore aspects of the present invention. The network system 100 comprisesa wireless mesh network 102, which may include a source node 110,intermediate nodes 130 and destination node 112. The source node 110 isable to communicate with certain intermediate nodes 130 viacommunication links 132. The intermediate nodes 130 communicate amongthemselves via communication links 134. The intermediate nodes 130communicate with the destination node 112 via communication links 136.The network system 100 may also include an access point 150, configuredto communicate with at least one node 130 via communications link 140, anetwork 152, and a server 154.

Any node 110, 112, 130, 150 may initiate a discovery protocolimplemented to determine node adjacency to one or more adjacent nodes.For example, intermediate node 130-2 may execute the discovery protocolto determine that nodes 110, 130-1, 130-3, and 130-5 are adjacent tonode 130-2. Furthermore, this node adjacency indicates thatcommunication links 132-2, 134-2, 134-4 and 134-3 may be establishedbetween the nodes 110, 130-1, 130-3, and 130-5, respectively. Anytechnically feasible discovery protocol may be implemented withoutdeparting the scope and spirit of embodiments of the present invention.

Once adjacency is established between the source node 110 and at leastone intermediate node 130, the source node 110 may generate payload datafor delivery to the destination node 112, when a path is available. Thepayload data may comprise an Internet protocol (IP) packet, an Ethernetframe, or any other technically feasible unit of data. Similarly, anytechnically feasible addressing and forwarding techniques may beimplemented to facilitate delivery of the payload data from the sourcenode 110 to the destination node 112. For example, the payload data mayinclude a header field configured to include a destination address, suchas an IP address or Ethernet media access control (MAC) address. Eachintermediate node 130 may be configured to forward the payload databased on the destination address. Alternatively, the payload data mayinclude a header field configured to include at least one switch labelto define a predetermined path from the source node 110 to thedestination node 112. A forwarding database may be maintained by eachintermediate node 130 that indicates which communication link 132, 134,136 should be used and in what priority to transmit the payload data fordelivery to the destination node 112. The forwarding database mayrepresent multiple paths to the destination address each of the multiplepaths may include one or more cost values. Any technically feasible typeof cost value may characterize a link or a path within the networksystem 100. In one embodiment, each node within the wireless meshnetwork 102 implements substantially identical functionality and eachnode may act as a source node, destination node or intermediate node.

As shown, the access point 150 is configured to communicate with atleast one node within the wireless mesh network 102, such asintermediate node 130-4. Communication may include transmission ofpayload data, timing data, or any other technically relevant databetween the access point 150 and the at least one node within thewireless mesh network 102. For example, communications link 140 may beestablished between the access point 150 and intermediate node 130-4 tofacilitate transmission of payload data between wireless mesh network102 and network 152. The access point 150 is coupled to the network 152,which may comprise any wired, optical, wireless, or hybrid networkconfigured to transmit payload data between the access point 150 and theserver 154. In one embodiment, the server 154 represents a destinationfor payload data originating within the wireless mesh network 102 and asource of payload data destined for one or more nodes within thewireless mesh network 102. In one embodiment, the server 154 executes anapplication for interacting with nodes within the wireless mesh network102. For example, nodes within the wireless mesh network 102 may performmeasurements to generate measurement data, such as power consumptiondata. The server 154 may execute an application to collect themeasurement data and report the measurement data. In one embodiment, theserver 154 queries nodes within the wireless mesh network 102 forcertain data. Each queried node replies with requested data, such asconsumption data, system status, data regarding proper performance, andso forth. In an alternative embodiment, each node within the wirelessmesh network 102 autonomously reports certain data, which is collectedby the 154 as the data becomes available via autonomous reporting.

FIG. 2 illustrates a digital radio transceiver 200 configured toimplement multi-channel operation, according to one embodiment of theinvention. Each node 110, 112, 130 within the wireless mesh network 102of FIG. 1 includes at least one instance of the digital radiotransceiver 200. The digital radio transceiver 200 may include, withoutlimitation, a microprocessor unit (MPU) 210, a digital signal processor(DSP) 214, digital to analog converters (DACs) 220, 221, analog todigital converters (ADCs) 222, 223, analog mixers 224, 225, 226, 227, aphase shifter 232, an oscillator 230, a power amplifier (PA) 242, a lownoise amplifier (LNA) 240, an antenna switch 244, and an antenna 246. Amemory 212 may be coupled to the MPU 210 for local program and datastorage. Similarly, a memory 216 may be coupled to the DSP 214 for localprogram and data storage.

In one embodiment, the MPU 210 implements procedures for processing IPpackets transmitted or received as payload data by the digital radiotransceiver 200. The procedures for processing the IP packets mayinclude, without limitation, wireless routing, encryption,authentication, protocol translation, and routing between and amongdifferent wireless and wired network ports. The MPU 210 may alsoimplement a packet transmission protocol, such as a four steptransmission protocol discussed in greater detail below in FIGS. 4A and4B. Alternatively, the DSP 214 may implement the four step transmissionprotocol.

The DSP 214 implements signal processing procedures for modulating aserialized representation of payload data comprising packets, such as IPpackets, for wireless transmission. The serialized representation mayencode one or more bits of payload data per modulation symbol. Areceiver may demodulate each modulation symbol to recover the one ormore bits of payload data. In one embodiment the one or more bits ofpayload data are used to generate a corresponding IP packet. The DSP 214may also implement multi-channel modulation for simultaneoustransmission of independent units of payload data via multiple,independent channels. Each independent channel occupies a differentfrequency range in a frequency domain representation of a transmittedradio signal. The DSP 214 also implements signal processing proceduresfor receiving payload data, such as payload data comprising IP packets.The procedures may include, without limitation filtering, energydetection, signal characterization, and simultaneous demodulation ofmultiple, independent channels.

In one embodiment, the DSP 214 is configured to modulate data within agiven channel using a particular modulation technique that is selectedform a set of different modulation techniques, based on prevailingchannel requirements. For a given packet of data, a particulartransmission bit rate may be implemented using one of the differentmodulation techniques, based on channel conditions. For example, if aselected channel is subjected to a relatively large amount of noise,then a lower bit rate modulation technique that is more tolerant ofnoise may be selected. Alternatively, if a selected channel is subjectedto relatively low noise and low loss, then a higher bit rate modulationtechnique may be selected despite a potentially reduced noise tolerance.Exemplary modulation techniques known in the art include, withoutlimitation, frequency shift keying (FSK) and quadrature amplitudemodulation (QAM). FSK may be implemented as a robust, but relatively lowbit rate technique for representing one or more bits of data permodulation symbol as signal energy in at least one of two or moredefined frequency bands. QAM may be implemented as a relatively high bitrate technique for representing a set of two or more bits per modulationsymbol within an amplitude-phase space. Each possible value representedby the two or more bits is mapped to a unique region within theamplitude-phase space. A collection of regions within theamplitude-phase space is known as a constellation. During modulation,each set of two or more bits comprising a modulation symbol is encodedand mapped to an appropriate region within a correspondingconstellation. Persons skilled in the art will understand thatquadrature encoded signal pairs may be used to conveniently implementQAM modulation. Furthermore, any technically feasible modulation,demodulation, filtering, energy detection, and signal characterizationtechniques may be implemented by the DSP 214 without departing the scopeand spirit of embodiments of the present invention.

The DSP 214 is coupled to DAC 220 and DAC 221. Each DAC 220, 221 isconfigured to convert a stream of outbound digital values into acorresponding analog signal. The outbound digital values are computed bythe signal processing procedures for modulating one or more channels.The DSP 214 is also coupled to ADC 222 and ADC 223. Each ADC 222, 223 isconfigured to sample and quantize an analog signal to generate a streamof inbound digital values. The inbound digital values are processed bythe signal processing procedures to demodulate and extract payload datafrom the inbound digital values.

In one embodiment, the DSP 214 generates two modulated streams ofoutbound digital values, which are converted to corresponding analogquadrature signals by DACs 220, 221. The analog quadrature signals areseparately mixed with a radio frequency (RF) carrier signal by analogmixers 224, 225 to generate corresponding quadrature RF signals, eachhaving a frequency domain image centered about the frequency of the RFcarrier signal. Oscillator 230 generates the RF carrier signal and phaseshifter 232 generates a 90-degree shifted representation of the RFcarrier signal for generating quadrature RF signals. The PA 242 combinesthe quadrature RF signals to generate a modulated RF signal, which iscoupled through the antenna switch 244 to the antenna 246. The antenna246 converts the modulated RF signal from an electrical representationto an electromagnetic representation for wireless transmission. Thewireless transmission may be directed to a different instance of thedigital radio transceiver 200, residing within a different node of thewireless mesh network 102.

When the digital radio transceiver 200 is receiving data, the antenna246 converts an incoming electromagnetic RF signal to an electrical RFsignal, which is coupled through the antenna switch 244 to the LNA 240.The LNA 240 amplifies the electrical RF signal and couples the amplifiedRF signal to analog mixers 226 and 227. The amplified RF signal ischaracterized as having a signal image centered about an RF carrierfrequency. The analog mixer 227 shifts the signal image down infrequency to an in-phase baseband component of the signal image. Thesignal is in-phase with respect to the RF carrier signal generated byoscillator 230. The analog mixer 226 shifts the signal image down infrequency to a 90-degree shifted baseband component of the signal image.The in-phase and 90-degree shifted baseband signals comprise aquadrature representation of one or more channels within the electricalRF signal. A plurality of different frequency channels may berepresented within the baseband signals. The DSP 214 is configured tomap the stream of inbound digital values, comprising a time domainrepresentation of the baseband signals, to a frequency domainrepresentation of the baseband signals. Persons skilled in the art willrecognize that the frequency domain representation may be used toefficiently isolate one data bearing signal within one channel from asignal within a different channel. Similarly, the frequency domainrepresentation may be used to detect noise and interfering transmissionswithin a given channel.

In one embodiment, the oscillator 230 can be programmed to generate oneselected frequency from a plurality of possible frequencies. Each of theplurality of frequencies corresponds to a different channel. Theselected frequency determines a center channel for a range of channelsthat are concurrently available to the DSP 214 or receiving ortransmitting data. For example, if a frequency range of 5 MHz definesfifty channels, and each channel is allocated a bandwidth of 100 kHz,then the selected frequency determines a center channel for fiveconcurrently available channels that are adjacent in frequency. In thisexample, a frequency range of 500 kHz from the overall frequency rangeof 5 Mhz is processed by the DSP 214 for transmitting or receiving dataon one or more of the five channels. If the oscillator 230 is programmedto generate a different selected frequency, then a different set of fiveconcurrently available channels may be used for transmitting orreceiving data. The center channel may be changed arbitrarily byprogramming the oscillator 230 independently of the DSP 214 operating onthe concurrently available channels. The digital radio transceiver 200may be configured with an arbitrary number of concurrently availablechannels configured to simultaneously and independently receive ortransmit data. Each channel may comprise an arbitrary bandwidth withoutdeparting the scope and spirit of embodiments of the present invention.

FIG. 3A illustrates a frequency hopping transmission that targets amulti-channel receiver, according to one embodiment of the presentinvention. A set of five concurrent receive channels 330 is selected,for example, by programming oscillator 230 of FIG. 2 to establishreceive channel “C” as the center channel for five channels denoted asC−2, C−1, C, C+1, C+2. Similarly, an identical set of five transmitchannels 332 is selected and denoted as C−2, C−1, C, C+1, C+2. Thecenter channel, C, maps to a particular wireless transmission frequencyvia the frequency of the RF carrier signal generated by oscillator 230.

A first instance of the digital radio transceiver 200 is configured tooperate as a transmitter, and a second instance of the digital radiotransceiver 200 is configured to operate as a receiver. The transmittermay transmit an RF signal on a particular transmit channel 336 within atime span (TS) 320. Each time span 320 may be specified as a maximumtransmission time, after which the transmitter may hop to a differentchannel to continue transmitting. In one embodiment, the transmitter isconfigured to transmit on one channel in any given time span 320. Inother embodiments, the transmitter is configured to concurrentlytransmit on two or more channels in a given time span 320.

The receiver is configured to monitor each receive channel C−2 throughC+2 within the set of five concurrent receive channels 330. If a databearing signal is received on one of the concurrent receive channels330, then the receiver demodulates the signal into a serial data stream.In one embodiment, the serial data stream is parsed and collected intoan IP packet, which is processed by the MPU 210. If two or more databearing signals are received, each on a separate channel, then each oneof the two or more data bearing signals is similarly demodulated into anindependent serial data stream. In one embodiment, the set of concurrentreceive channels 330 is nominally identical to the set of transmitchannels 332. In alternative embodiments, the set of concurrent receivechannels 330 may be a superset of the transmit channels 332.

As shown, the transmitter frequency-hops in a particular channelsequence. In this example, the channel sequence is {C+1, C−1, C−2, C,C+2} in time spans 320-1, 320-2, 320-3, 320-4, and 320-5, respectively.Payload data 310-1, 310-2, 310-3, 310-4, and 310-5 are transmitted intime spans 320-1, 320-2, 320-3, 320-4, and 320-5, respectively. In oneembodiment, payload data 310 transmitted in a given time span 320comprises at least a portion of an IP packet, such as a whole IP packetor an IP packet fragment.

Importantly, because the receiver is always able to capture anddemodulate a data bearing signal within the set of concurrent receivechannels 330, hop synchronization with the transmitter is substantiallysimplified. As a consequence, related overhead and transmissioninefficiency is eliminated or greatly mitigated. In one embodiment, eachcommunication link 132, 134, 136, 140 of FIG. 1 is established with apersistent center channel during execution of the discover protocol. Inalternative embodiments, a center channel is established dynamically inresponse to prevailing transmission conditions or via a predeterminedhop sequence. Persons skilled in the art will recognize that anytechnically feasible technique may be implemented to establish aconsistent center channel C for the transmitter and receiver withoutdeparting the scope and spirit of embodiments of the present invention.

FIG. 3B represents energy within a group of channels for one time span,according to one embodiment of the present invention. As shown, afrequency domain image 352 represents energy associated with channel C+1during time span 320-1 of FIG. 3A. The receiver is configured tocharacterize the other frequency domain images 350 to determine whetherthey represent data bearing signals and should be processed by thereceiver or ignored. If one of the frequency domain images 350 is a databearing signal, then the receiver determines a type for the data bearingsignal and demodulates the data bearing signal based on the type. Thetype may define a modulation technique, bit rate, or any othertechnically feasible signal characteristic.

FIG. 3C represents energy within the group of channels for another timespan, according to one embodiment of the present invention. As shown, afrequency domain image 354 represents energy associated with channel C−1during time span 320-2 of FIG. 3A. Frequency domain image 350-3 mayrepresent interference, noise, or a data bearing signal that should beprocessed.

FIG. 3D illustrates channel group hopping, according to one embodimentof the present invention. In this example, five concurrently availablechannels, C−2 through C+2, comprise a channel group 362 that may bemapped onto different allocated channels. An allocated channel is achannel allocated to a particular radio communications service in whichdigital radio transceiver 200 is configured to operate. Allocatedchannels may comprise contiguous RF spectrum or non-contiguous RFspectrum, however each channel group 362 should be allocated withinsubstantially contiguous RF spectrum.

In one example, channel group 362-1 comprises allocated channels 1-5,which are processed as available channels C−2 through C+2 by DSP 214.Channel group 362-2 comprises allocated channels 6-10, which are alsoprocessed as available channels C−2 through C+2 by DSP 214. In thisexemplary channel group hopping sequence, center channel C issequentially mapped to channel 3, 8, 18, and 13. In one embodiment,oscillator 230 is programmed to establish which channels within anincoming RF signal are translated in frequency domain to map ontoavailable channels C−2 through C+2 for processing by DSP 214. Eachchannel group 362 may be active for a certain time span (TS) 360. Forexample, channel groups 362-1 through 362-4 may remain active for timespans 360-1 through 360-4, respectively. Each time span 360 may conformto a specified duration or may be arbitrarily long in duration. Forexample, a given channel group may remain active until accumulatedtransmission time requires a certain transmitter to vacate all channelswithin the current channel group to satisfy regulated transmission timelimits.

Any technically feasible technique may be used to select and coordinatea particular channel hopping sequence. In one embodiment, digital radiotransceiver 200 explicitly transmits a new center channel on anavailable channel prior to initiating a hop for a channel group. Forexample, digital radio transceiver 200 may transmit a message indicatinga new center channel 18 prior to transitioning from channel group 362-2to 362-3. Persons skilled in the art will recognize that this and othertechniques may be used to perform channel group hopping withoutdeparting the scope and spirit of embodiments of the present invention.

FIG. 4A illustrates a four step communications protocol for transmittingpayload data to a single transmission target, according to oneembodiment of the present invention. The communications protocolincludes a polling step 450, a poll acknowledgement step 452, a payloaddata transmission step 454, and a data acknowledgement step 456. In oneembodiment, the source node 110 of FIG. 1 is able to transmit payloaddata via one of a plurality of potential communication links, based,without limitation, on poll acknowledgement data and prevailingtransmission conditions sampled during the polling and acknowledgementsteps. In this way, an open delivery path may be advantageously selectedbased on prevailing system conditions.

During the polling step 450, the source node 110 performs a query toadjacent nodes, such as intermediate nodes 130-1, 130-2, and 130-3 todetermine which adjacent nodes are able to accept payload data. In oneembodiment, the query comprises simultaneously transmitting one or morepoll messages 420 to the adjacent nodes. The poll messages 420 may betransmitted to individually target adjacent nodes as shown.Alternatively, the poll messages may be transmitted as one or morebroadcast messages to any potentially listening adjacent nodes. Duringthe poll acknowledgement step 452, each adjacent node that is able toaccept payload data responds with a poll acknowledgement message 422. Inone embodiment, the poll acknowledgement message 422 includes anavailability attribute, indicating, without limitation, that thecorresponding adjacent node is not able to accept payload data now, butwill be able to accept payload data at or after a specified future time.Any technically feasible technique may be implemented for specifying andsynchronizing time between nodes within the wireless mesh network 102.

In one embodiment, the source node 110 measures signal strengthassociated with each poll acknowledgement message 422 as a measure ofcommunication link quality to the corresponding adjacent node. Noiselevel, bit error rate, or any other technically feasible metric may alsobe measured to determine communication link quality. A communicationlink having relatively strong signal strength and relatively low noiseis characterized herein as qualitatively “loud.” A quantitative loudnesscharacteristic may be computed using signal strength, noise, bit errorrate, or any other technically feasible metrics. For example, loudnessmay be computed as a numerical difference or ratio between signalstrength and noise level. The source node 110 may use one or more linkqualities, such as loudness, to select an adjacent node as a target fortransmission of payload data.

In certain embodiments, each adjacent node performs communication linkquality measurements on incoming poll messages 420. Each adjacent nodethen includes results of the link quality measurements in acorresponding poll acknowledgement message 422. Because noise may belocalized to the adjacent node, a link quality measurement taken by theadjacent node is sometimes as significant in determining communicationlink quality as a noise measurement taken by the source node 110. Thesource node 110 may consider link quality measurements taken by adjacentnodes to select an adjacent node as a target for transmission of payloaddata.

In a data transmission step 454, the source node 110 selects an adjacentnode and transmits a data message 440-2, comprising payload data, to theselected adjacent node. In a data acknowledgement step 456, the selectedadjacent node transmits a data acknowledgement message 442-1 back to thesource node 110 to indicate reliable receipt of the data message 440-2.

In the above example, the source node 110 transmits poll messages 420-1,420-2, and 420-3 to intermediate nodes 130-1, 130-2, and 130-3,respectively. Only intermediate nodes 130-1, 130-2 acknowledge, via pollacknowledgement messages 422-1, 422-2, that they are able to receivepayload data. Intermediate node 130-3 did not acknowledge the poll forone or more reasons, including possible scenarios where poll message420-3 was corrupted in flight, the intermediate node 130-3 was busy, andso forth.

As shown, the source node 110 selects intermediate node 130-2 andtransmits data message 440-2 to intermediate node 130-2. Intermediatenode 130-2 then acknowledges receipt via data acknowledge message 442-2.After the intermediate node 110 receives and processes the dataacknowledge message 442-2, the payload data is deemed to have beensuccessfully transmitted to the intermediate node 130-2. A message maybe lost at any step of the four step communications protocol fortransmitting payload data. If such a loss occurs, the transmission isconsidered to have failed. Because a transmission may succeed along onecommunication link but ultimately fail, and end-to-end protocol shouldbe employed to ensure reliable delivery for packets that requirereliable delivery. In one embodiment, the digital radio transceiver 200implements the well-known transmission communication protocol (TCP) andinternet protocol (IP) protocols for transmission of IP packets. The IPpackets are mapped into an implementation specific transmission formatcomprising payload data. Other technically feasible transmissionprotocols may also be implemented without departing the scope and spiritof embodiments of the present invention.

Source node 110 may transmit one or more poll messages 420, one or moredata messages 440, or any combination thereof simultaneously on one ormore channels from the available channels. A given node 130 may transmitone or more poll acknowledgement message 422, one or more dataacknowledgement messages 442, or any combination thereof simultaneouslyon one or more channels from the available channels. The node 130 maytransmit a poll acknowledgement message 422 on the same channel as acorresponding poll message 420 or on a different available channel fromthe poll message 420. Similarly, the node 130 may transmit a dataacknowledgement message 442 on the same channel as a corresponding datamessage 440 or on a different available channel from the correspondingdata message 440. In one embodiment, node 130 selects a channel foreither a poll acknowledgement message 422 or a data acknowledgementmessage 442 based on channel availability and at least one channelparameter, including, without limitation, energy detected within theavailable channels, historical transmission success statistics, andlocal regulatory limits or requirements.

In one usage scenario, node 130 receives multiple data messages 440 frommultiple different sources 110 and transmits acknowledgement messages422, 442 on channels corresponding to data messages being acknowledged.In another usage scenario, node 130 receives multiple data messages 440from multiple different sources 110 but transmits acknowledgementmessages 422, 442 on different channels from the data messages beingacknowledged. In yet another usage scenario, node 130 receives multipledata messages 440 from multiple different sources 110, but transmits anaggregated data acknowledgement message indicating successful receipt ofat least two different data messages 440 from at least two differentsources 110.

FIG. 4B illustrates a four step communications protocol for transmittingpayload data to multiple transmission targets, according to oneembodiment of the present invention. As shown, FIG. 4A is extended hereto include multiple data messages 440. Specifically, the source node 110transmits data messages 440-1 and 440-2 to intermediate nodes 130-1 and130-2, respectively. In this example, data message 440-2 is notsuccessfully transmitted to intermediate node 130-2 and notacknowledged. However, the same payload data was successfullytransmitted to intermediate node 130-1. In this example, three pollingmessages 420-1, 420-2, and 420-3 yielded two poll acknowledgementmessages 422-1 and 422-2, which led to two data messages 440-1 and440-2. Only one of the data messages 440 was acknowledged via pollacknowledgement message 442-1.

By enabling a receiver to simultaneously receive payload data frommultiple transmitters at any time, and without the need to synchronizefrequency hopping timing information, greater transmission efficiency isachieved. Polling multiple adjacent nodes for availability increases theprobability that one or more adjacent nodes will be available. Havingmultiple poll results also enables the source node 110 to select amongpotential adjacent node candidates based on prevailing transmissionconditions, thereby increasing the probability of successful delivery toa selected adjacent node. Increasing successful delivery reducesre-tries, which has the effect of increasing overall throughput networkcapacity. Transmitting multiple instances of payload data, referred toas “flooding” in certain scenarios, yet further increases theprobability of successful delivery, but may impact overall networkthroughput. In one embodiment, certain packets, such as control packets,are marked for high-priority delivery and are transmitted to multipleintermediate nodes 130 from the source node 110. Other packets are notmarked for high-priority delivery and are only delivered to oneintermediate node from the source node 110.

In one usage scenario, source node 110 is configured to simultaneouslytransmit two or more poll messages 420 to corresponding nodes 130 on twoor more corresponding channels from the available channels. In such ascenario, source node 110 attempts to find at least two different nodes130 to which two or more data messages 440 may be transmitted. Each ofthe two or more data messages may comprise the same data payload toincrease the likelihood of successful transmission or different datapayloads to increase overall throughput. In another usage scenario,source node 110 is configured to simultaneously transmit two or morepoll messages 420 to the same node 130 on two or more correspondingchannels. In this usage scenario, source node 110 is attempting to findat least one reliable channel within which to transmit a data message440. Upon receiving two or more poll acknowledgement messages 422, thesource node 110 may transmit corresponding copies of the data message440 to the same node 130. In this usage scenario, source node 110 isattempting to increase the likelihood of a successful transmission.Alternatively, source node 110 may transmit different data messages 440on the two or more acknowledged channels to the same node 130 toincrease transmission throughput.

In one embodiment, node 130 selects a channel for either a pollacknowledgement message 422 or a data acknowledgement message 442 basedon channel availability and at least one channel parameter, including,without limitation, energy detected within the available channels,historical transmission success statistics, and local regulatory limitsor requirements.

In certain embodiments, the digital radio transceiver 200 is configuredto listen to a channel prior to transmitting on the channel in atechnique referred to as listen before transmitting (LBT). If thechannel is occupied or exhibits significant noise, then a differentchannel is selected for transmission. Any technically feasible LBTtechnique may be implemented without departing the scope and spirit ofthe present invention.

FIG. 5 is a flow diagram of method steps 500 for transmitting payloaddata via the four step communications protocol, according to oneembodiment of the invention. Although the method steps are described inconjunction with the systems of FIGS. 1 and 2, persons skilled in theart will understand that any system configured to perform the methodsteps, in any order, is within the scope of the present invention. Thismethod may be performed by the digital radio transceiver 200 or anytechnically feasible radio transceiver system.

The method begins in step 510, where the digital radio transceivertransmits a poll message to query adjacent nodes to determine theiravailability as candidates to receive a data transmission. In step 512,the digital radio transceiver receives poll acknowledgement messagesfrom one or more responding candidate nodes. In step 514, the digitalradio transceiver calculates loudness for the one or more respondingcandidate nodes. As described previously, loudness may be computed frommeasurements performed by the digital radio transceiver, measurementsperformed by a remote instance of the digital radio transceiver, or anycombination thereof. In alternative embodiments, link quality metricsother than loudness may be implemented. In step 516, the digital radiotransceiver selects a target node from the one or more respondingcandidate nodes. In multi-data transmission embodiments, the digitalradio transceiver may select one or more additional target nodes, ifpossible, from the one or more responding candidate nodes.

In step 520, the digital radio transceiver transmits a data message tothe selected target node. In multi-data transmission embodiments, thedigital radio transceiver transmits the data message to the one or moreadditional selected target nodes. In step 522, the digital radiotransceiver receives a data acknowledgement message, indicatingsuccessful delivery of at least one data message. The method terminatesin step 522.

FIG. 6 is a flow diagram of method steps 600 for receiving payload datavia the four step communications protocol, according to one embodimentof the present invention. Although the method steps are described inconjunction with the systems of FIGS. 1 and 2, persons skilled in theart will understand that any system configured to perform the methodsteps, in any order, is within the scope of the present invention. Thismethod may be performed by the digital radio transceiver 200 or anytechnically feasible radio transceiver system.

The method begins in step 610, where a transmission target, such as anintermediate node 130 of FIG. 1, receives an incoming message that isthen identified as a poll message based on an inspection of payload datafor the incoming message. In one embodiment, the payload data isorganized as an IP packet. The incoming message may be receivedaccording to the method steps 700 of FIG. 7, below. The poll message maycomprise poll message 420 of FIG. 4A, from a source node, such as sourcenode 110. In one embodiment, two or more poll messages may be receivedsimultaneously on different channels from different source nodes. Instep 612, the transmission target transmits a poll acknowledgmentmessage, such as poll acknowledgment message 422, to the source node. Inscenarios where two or more poll messages are received, the transmissiontarget may acknowledge each poll message, either sequentially orsimultaneously. In one embodiment, the poll acknowledgement messageincludes local channel noise and occupancy information measured by thetransmission target. In certain embodiments, the poll acknowledgementmessage includes availability data that indicates when, if at all, thetransmission target will be able to accept a data message. In step 614,the transmission target receives a data message, such as data message440, from the source node. In one embodiment the data message comprisesan IP packet or an IP packet fragment. In step 616, the transmissiontarget transmits a data acknowledgment message, such as dataacknowledgment message 442, to the source node. In step 620, thetransmission target forwards the data message to another node, such asanother intermediate node 130 or a destination node 112. Forwarding thedata message comprises selecting one or more target nodes and thentransmitting payload data to the one or more target nodes. Anytechnically feasible technique may be used to select the one or moretarget nodes, which may each comprise a next hope for delivering thepayload data to a destination node, such as destination node 112. In oneembodiment, the transmission target performs the method steps 500 ofFIG. 5 to transmit payload data being forwarded to the one or moretarget nodes. Similarly, the transmission target may perform the methodsteps 500 of FIG. 5 to transmit the poll acknowledgement message and thedata acknowledgement message. The method terminates in step 620.

FIG. 7 is a flow diagram of method steps 700 for receiving payload datavia one of a plurality of radio frequency channels, according to oneembodiment of the present invention. Although the method steps aredescribed in conjunction with the systems of FIGS. 1 and 2, personsskilled in the art will understand that any system configured to performthe method steps, in any order, is within the scope of the presentinvention. This method may be performed by the digital radio transceiver200 or any technically feasible radio transceiver system.

The method begins in step 710, where the digital radio transceiversamples radio spectrum, such as radio spectrum corresponding to thereceive channels, such as receive channels 330 of FIG. 3A. If, in step712, energy is detected within the receive channels, then the methodproceeds to step 714, where the digital radio transceiver characterizesa signal within the receive channels.

If, in step 716, a signal type for the signal is known, then the methodproceeds to step 718, where receiver circuits within the digital radiotransceiver are configured to detect the signal within the receivechannels. The configuration may specify, without limitation, a type ofmodulation, a bit rate, and one or more filtering options.

If, in step 720, a frame of payload data is received intact, then themethod proceeds to step 722, where the digital radio transceiverprocesses the received packet. In one embodiment the packet is an IPpacket and is processed by the MPU 210 of FIG. 2. The method terminatesin step 722.

Returning to step 712, if no energy is detected within the receivechannels, then the method proceeds back to step 710.

Returning to step 716, if the signal type is not known, then the methodproceeds back to step 710.

Returning to step 720, if the frame of payload data is not receivedintact, then the method proceeds back to step 710.

The method steps 700 may be performed independently and concurrently foreach channel within the set of receive channels.

In sum, a technique for frequency hopping spread spectrum transmissionis disclosed. A multi-channel receiver is configured to listen tomultiple channels simultaneously, enabling the receiver to detectincoming data from an arbitrary hop sequence without priorsynchronization with the transmitter. In a wireless mesh network, thiscapability advantageously enables each node to participate moreefficiently in transmitting data within the wireless mesh network.

One advantage of the disclosed systems and methods is that latency anddelivery probability are improved within a wireless mesh network. Inparticular, frequency hopping spread spectrum efficiency is improved inthe wireless mesh network.

While the forgoing is directed to embodiments of the present invention,other and further embodiments of the invention may be devised withoutdeparting from the basic scope thereof. For example, aspects of thepresent invention may be implemented in hardware or software or in acombination of hardware and software. One embodiment of the inventionmay be implemented as a program product for use with a computer system.The program(s) of the program product define functions of theembodiments (including the methods described herein) and can becontained on a variety of computer-readable storage media. Illustrativecomputer-readable storage media include, but are not limited to: (i)non-writable storage media (e.g., read-only memory devices within acomputer such as CD-ROM disks readable by a CD-ROM drive, flash memory,ROM chips or any type of solid-state non-volatile semiconductor memory)on which information is permanently stored; and (ii) writable storagemedia (e.g., floppy disks within a diskette drive or hard-disk drive orany type of solid-state random-access semiconductor memory) on whichalterable information is stored. Such computer-readable storage media,when carrying computer-readable instructions that direct the functionsof the present invention, are embodiments of the present invention.

In view of the foregoing, the scope of the present invention isdetermined by the claims that follow.

I claim:
 1. A method for forwarding a packet of data within a wirelessnetwork from a source node to a destination node via an intermediatenode, the method comprising: receiving from a first source node thatrequests availability information for the intermediate node a first pollmessage via a first channel within a channel group; transmitting to thefirst source node a first acknowledgement message that includes theavailability information for the intermediate node via a second channelin the channel group; receiving from the first source node via a thirdchannel in the channel group a first data message that includes a firstset of payload data to be forwarded to a first destination node;transmitting to the first source node a first data-acknowledge messagethat indicates successful receipt of the first data message via a fourthchannel in the channel group; forwarding the first set of payload datato the first destination node; and concurrently transmitting data to asecond source node on any available channel in the channel group whileforwarding the first set of payload data to the first destination node,or concurrently receiving data from the second source node on anyavailable channel in the channel group while forwarding the first set ofpayload data to the first destination node, wherein the channel groupcomprises four or more channels within a plurality of allocatedchannels, and wherein the available channel in the channel groupcomprises one of the first channel, the second channel, the thirdchannel, and the fourth channel.
 2. The method of claim 1, furthercomprising: concurrently receiving from the second source node a secondpoll message via a fifth channel within the channel group; transmittingto the second source node a second acknowledgement message that includesthe availability information for the intermediate node via a sixthchannel; receiving from the second source node a second data message;and transmitting to the second source node a second data-acknowledgemessage that indicates successful receipt of the second data message. 3.The method of claim 2, wherein the first data-acknowledge message andthe second data-acknowledge message comprise one aggregateddata-acknowledge message.
 4. The method of claim 1, wherein the firstacknowledgement message includes a time value that indicates when theintermediate node is available to receive the first data message.
 5. Themethod of claim 1, wherein the first data-acknowledge message includes anoise measurement associated with the first channel that is sampled bythe intermediate node.
 6. The method of claim 1, wherein the secondchannel is selected based on historical success statistics fortransmission on each channel associated with the channel group as wellas local regulatory requirements.
 7. The method of claim 1, whereinforwarding payload data to the destination node comprises: selecting afirst destination node based on information residing in a forwardingdatabase maintained by the intermediate node; and transmitting to thefirst destination node the first set of payload data.
 8. The method ofclaim 7, further comprising: selecting a second destination node basedon information residing in the forwarding database; and transmitting tothe second destination node a second set of payload data.
 9. The methodof claim 8, wherein the first set of payload data and at least a portionof the second set of payload data are transmitted simultaneously ondifferent channels.
 10. The method of claim 9, wherein the firstdestination node and the second destination node comprise the same node.11. The method of claim 8, wherein selecting channels for transmittingdata to each destination node is based on historical success statisticsfor transmission within each channel associated with the channel groupas well as local regulatory requirements.
 12. The method of claim 1,wherein the channel group comprises each channel included in theplurality of allocated channels.
 13. The method of claim 1, wherein theplurality of allocated channels comprises at least one spectral gapbetween two adjacent channels.
 14. The method of claim 1, wherein theavailability information includes an availability attribute indicatingthat the intermediate node is not available to accept data at a currenttime, and will be available to accept data at, or after, a later time.15. The method of claim 1, wherein the available channel in the channelgroup comprises a fifth channel in the channel group.
 16. The method ofclaim 1, further comprising generating the channel group by: selecting acenter channel that defines a range of channels; and identifying asubset of channels from within the plurality of allocated channels thatis included in the range of channels.
 17. The method of claim 16,wherein each channel in the range of channels is associated with abandwidth that is adjacent on a frequency spectrum to a bandwidthassociated with at least one other channel in the range of channels. 18.The method of claim 1, wherein the first set of payload data isforwarded to the first destination node on a different channel than theavailable channel in the channel group.
 19. A non-transitorycomputer-readable storage medium including instructions that, whenexecuted by a signal processing unit, cause the signal processing unitto forward a packet of data within a wireless network from a source nodeto a destination node via an intermediate node by performing the stepsof: receiving from a first source node that requests availabilityinformation for the intermediate node a first poll message via a firstchannel within a channel group; transmitting to the first source node afirst acknowledgement message that includes the availability informationfor the intermediate node via a second channel in the channel group;receiving from the first source node via a third channel in the channelgroup a first data message that includes a first set of payload data tobe forwarded to a first destination node; transmitting to the firstsource node a first data-acknowledge message that indicates successfulreceipt of the first data message via a fourth channel in the channelgroup; forwarding the first set of payload data to the first destinationnode; and concurrently transmitting data to a second source node on anychannel in the channel group while forwarding the first set of payloaddata to the first destination node, or concurrently receiving data fromthe second source node on any channel in the channel group whileforwarding the first set of payload data to the first destination node,wherein the channel group comprises four or more channels within aplurality of allocated channels, and wherein the available channel inthe channel group comprises one of the first channel, the secondchannel, the third channel, and the fourth channel.
 20. Thenon-transitory computer-readable storage medium of claim 19, furthercomprising: concurrently receiving from the second source node a secondpoll message via a fifth channel within the channel group; transmittingto the second source node a second acknowledgement message that includesthe availability information for the intermediate node via a sixthchannel; receiving from the second source node a second data message;and transmitting to the second source node a second data-acknowledgemessage that indicates successful receipt of the second data message.21. The non-transitory computer-readable storage medium of claim 20,wherein the first data-acknowledge message and the seconddata-acknowledge message comprise one aggregated data-acknowledgemessage.
 22. The non-transitory computer-readable storage medium ofclaim 19, wherein forwarding payload data to the destination nodecomprises: selecting a first destination node based on informationresiding in a forwarding database maintained by the intermediate node;and transmitting to the first destination node the first set of payloaddata.
 23. The non-transitory computer-readable storage medium of claim22, further comprising: selecting a second destination node based oninformation residing in the forwarding database; and transmitting to thesecond destination node a second set of payload data.
 24. Thenon-transitory computer-readable storage medium of claim 23, wherein thefirst set of payload data and at least a portion of the second set ofpayload data are transmitted simultaneously on different channels. 25.The non-transitory computer-readable storage medium of claim 23, whereinselecting channels for transmitting data to each destination node isbased on historical success statistics for transmission within eachchannel associated with the channel group as well as local regulatoryrequirements.
 26. The non-transitory computer-readable storage medium ofclaim 19, wherein the channel group comprises each channel included inthe plurality of allocated channels.
 27. The non-transitorycomputer-readable medium of claim 19, wherein the availabilityinformation includes an availability attribute indicating that theintermediate node is not available to accept data at a current time, andwill be available to accept data at, or after, a later time.
 28. Awireless network device configured to forward a packet of data from asource node to a destination node via an intermediate node within awireless network, comprising: a radio transceiver circuit configured to:receive an incoming radio signal comprising a plurality ofsimultaneously monitored channels; and transmit an outbound radio signalcomprising a transmitter channel; and a signal processing unit that iscoupled to the radio transceiver circuit and configured to: receive froma first source node that requests availability information for theintermediate node a first poll message via a first channel within achannel group; transmit to the first source node a first acknowledgementmessage that includes the availability information for the intermediatenode via a second channel in the channel group; receive from the firstsource node via a third channel in the channel group a first datamessage that includes a first set of payload data to be forwarded to afirst destination node; transmit to the first source node a firstdata-acknowledge message that indicates successful receipt of the firstdata message via a fourth channel in the channel group; forward thefirst set of payload data to the first destination node; andconcurrently transmit data to a second source node on any channel in thechannel group while forwarding the first set of payload data to thefirst destination node, or concurrently receive data from the secondsource node on any channel in the channel group while forwarding thefirst set of payload data to the first destination node, wherein thechannel group comprises four or more channels within a plurality ofallocated channels, and wherein the available channel in the channelgroup comprises one of the first channel, the second channel, the thirdchannel, and the fourth channel.
 29. The wireless network device ofclaim 28, wherein the signal processing unit is further configured to:concurrently receive from the second source node a second poll messagevia a fifth channel within the channel group; transmit to the secondsource node a second acknowledgement message that includes theavailability information for the intermediate node via a sixth channel;receive from the second source node a second data message; and transmitto the second source node a second data-acknowledge message thatindicates successful receipt of the second data message.
 30. Thewireless network device of claim 29, wherein the first data-acknowledgemessage and the second data-acknowledge message comprise one aggregateddata-acknowledge message.
 31. The wireless network device of claim 29,wherein the availability information includes an availability attributeindicating that the intermediate node is not available to accept data ata current time, and will be available to accept data at, or after, alater time.
 32. The wireless network device of claim 28, wherein toforward payload data to the destination node, the signal processing unitis configured to: select a first destination node based on informationresiding in a forwarding database maintained by the intermediate node;and transmit to the first destination node the first set of payloaddata.
 33. The wireless network device of claim 32, wherein the signalprocessing unit is further configured to: select a second destinationnode based on information residing in the forwarding database; andtransmit to the second destination node a second set of payload data.34. The wireless network device of claim 33, wherein the first set ofpayload data and at least a portion of the second set of payload dataare transmitted simultaneously on different channels.
 35. The wirelessnetwork device of claim 33, wherein selecting channels for transmittingdata to each destination node is based on historical success statisticsfor transmission within each channel associated with the channel groupas well as local regulatory requirements.
 36. The wireless networkdevice of claim 28, wherein the channel group comprises each channelincluded in the plurality of allocated channels.